The Procedure Transformation using Data Dependency Elimination Methods

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Splay Leg in a Dutch Laboratory Rabbit Colony: Detection Methods and Effective Elimination Procedure

In rabbits, especially in some races, limb movement disorder called splay legs, are mostly unilateral or bilateral in front or hind legs at an early age. The severity ranges from mild to severe in this case. In breeding colony of albino Dutch laboratory rabbits, the splay leg disorder has been observed over the years permanently.Within the scope of this research, 1.5-2.5% of 700-750 number of c...

متن کامل

data mining rules and classification methods in insurance: the case of collision insurance

assigning premium to the insurance contract in iran mostly has based on some old rules have been authorized by government, in such a situation predicting premium by analyzing database and it’s characteristics will be definitely such a big mistake. therefore the most beneficial information one can gathered from these data is the amount of loss happens during one contract to predicting insurance ...

15 صفحه اول

Paper 1065-2017: Using the OPTGRAPH Procedure: Transformation of Transactional Data into Graph for Cluster Analysis

Graph is a mathematic structure capable of representing a network of objects and their relationships. Clustering is an area in graph theory where objects are split into groups based on information of their connections. Depending on the field of the data, object clusters have various meanings, e.g., in the market basket analysis, clusters are families of products that are frequently or likely pu...

متن کامل

The Elimination Procedure for the Phylogeny Number

Given an acyclic digraph D, the phylogeny graph P (D) is defined to be the undirected graph with V (D) as its vertex set and with adjacencies as follows: two vertices x and y are adjacent if one of the arcs (x, y) or (y, x) is present in D, or if there exists another vertex z such that the arcs (x, z) and (y, z) are both present in D. Phylogeny graphs were introduced by Roberts and Sheng [6] fr...

متن کامل

The Extended Elimination by Aspects Procedure ∗

Standard decision theory assumes that the choice set is given. In contrast, I develop a model called ‘extended elimination by aspects’ in which decision-makers discover and analyse alternatives sequentially and choose according to a boundedly rational procedure that is based on three heuristics: ‘satisficing’, lexicographic, and elimination by aspects. I show that the proposed choice procedure ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The KIPS Transactions:PartA

سال: 2002

ISSN: 1598-2831

DOI: 10.3745/kipsta.2002.9a.1.037